Note on primitive permutation groups and a diophantine equation
نویسندگان
چکیده
If a group G has a maximal subgroup H, tl-.en G acts by right multiplication on the set fi of right cosets of H in G as a primitive, but not necessarily faithful, permutation group. As part of the search for new finite simple groups it is of interest to determine all possible groups G, and in particular all simple groups, which contain a given group H as a maximal subgroup. This problem is very difficult, but if the permutation representation induced on In has small rank and is faithful it has been solved for certain groups H. In this paper we assume that G is faithful on In and that H has an orbit A in c1 such that PSL(m, q)~ HA s PlYL(m, q) in its natural representation on the points or hyperplanes of the projective space, for some m ‘3 and prime power q. The case in which G has rank 2 on a was dealt with by H. Zassenhaus [l l] and D.R. Hughes [7]. We shall show that there exist no groups G which have rank 3 on a. This result is a generalisation of Bannai [2] which has the additional assumptions that H is faithful on A and q is even. Using a recent result of one of the authors [9] and the powerful restrictions on intersection numbers developed by D.G. HIgm~r. [4] we could show that either q = 3, m = 5, or q = 5 and 5”’ + 11 is a perfect square. The former case was eliminated by considering the action of a Sylow 13-subgroup. A very complicated general argument involving geometry and a Sylow p-subgroup, where p is a prime greater than 5 dividing (5”-* l), could be constructed to eliminate the other case. However the diophantine equation
منابع مشابه
On the Diophantine Equation x^6+ky^3=z^6+kw^3
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...
متن کاملOn Cornacchia’s algorithm for solving the diophantine equation
We give a new proof of the validity of Cornacchia’s algorithm for finding the primitive solutions (u, v) of the diophantine equation u + dv = m, where d and m are two coprime integers. This proof relies on diophantine approximation and an algorithmic solution of Thue’s problem.
متن کاملFermat's 'primitive Solutions' and Some Arithmetic of Elliptic Curves
In his work on Diophantine equations of the form y2=ax4+bx3+cx2+dx+e, Fermat introduced the notion of primitive solutions. In this expository note we intend to interpret this notion more geometrically, and explain what it means in terms of the arithmetic of elliptic curves. The specific equation y2 =x4 + 4x3 + 102 +20x+ 1 was used extensively by Fermat as an example. We illustrate the nowadays ...
متن کاملPrimitive coherent configurations: On the order of uniprimitive permutation groups
These notes describe the author’s elementary graph theoretic proof of the nearly tight exp(4 √ n ln n) bound on the order of primitive, not doubly transitive permutation groups (Ann. Math., 1981 ). The exposition incorporates a lemma by V. N. Zemlyachenko that simplifies the proof. The central concept in the proof is primitive coherent configurations, a combinatorial relaxation of the action of...
متن کاملPrime order derangements in primitive permutation groups
Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|. We say that G is r-elusive if it does not contain a derangement of order r, and strongly r-elusive if it does not contain one of r-power order. In this note we determine the r-elusive and strongly r-elusive primitive acti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 31 شماره
صفحات -
تاریخ انتشار 1980